Insertion Sorter in P Systems

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A versatile linear insertion sorter based on an FIFO scheme

A linear sorter based on a first-in first-out (FIFO) scheme is presented. It is capable of discarding the oldest stored datum and inserting the incoming datum while keeping the rest of the stored data sorted in a single clock cycle. This type of sorter can be used as a co-processor or as a module in specialized architectures that continuously require to process data for non-linear filters based...

متن کامل

Array Insertion and Deletion P Systems

Let d ∈ N; then a d-dimensional array A over an alphabet V is a function A : Z → V ∪ {#}, where shape (A) = { v ∈ Z | A (v) 6= # } is finite and # / ∈ V is called the background or blank symbol. The set of all d-dimensional arrays over V is denoted by V ∗d. For v ∈ Z, v = (v1, . . . , vd), the norm of v is ‖v‖ = max {|vi| | 1 ≤ i ≤ d}. The translation τv : Z → Z is defined by τv (w) = w+ v for ...

متن کامل

P systems with minimal insertion and deletion

1 IEC, Department of Information Engineering, Graduate School of Engineering Hiroshima University, Higashi-Hiroshima 739-8527 Japan 2 Research Group on Mathematical Linguistics, Rovira i Virgili University Av. Catalunya, 35, Tarragona 43002 Spain [email protected] 3 Institute of Mathematics and Computer Science, Academy of Sciences of Moldova Academiei 5, Chişinău MD-20...

متن کامل

On the Power of Insertion P Systems of Small Size

In this article we investigate insertion systems of small size in the framework of P systems. We consider P systems with insertion rules having one symbol context and we show that they have the computational power of matrix grammars. If contexts of length two are permitted, then any recursively enumerable language can be generated. In both cases an inverse morphism and a weak coding were applie...

متن کامل

Data-Driven Control Scheme for Linear Arrays: Application to a Stable Insertion Sorter

We present a strategy for designing stable insertion sorters based on linear arrays with data-driven control. The novelty of our approach lies in each data item carrying a control tag to specify how it is to be operated upon by a receiving cell and in performing two parallel comparisons within each cell. To assure first-in/first-out handling of equal key values, some data items must be marked t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Physics: Conference Series

سال: 2018

ISSN: 1742-6588,1742-6596

DOI: 10.1088/1742-6596/976/1/012004